Embedding Finite Partial Linear Spaces in Finite Translation Nets

نویسندگان

  • G. Eric Moorhouse
  • Jason Williford
چکیده

In the 1970’s Paul Erdős and Dominic Welsh independently posed the problem of whether all finite partial linear spaces L are embeddable in finite projective planes. Except for the case when L has a unique embedding in a projective plane with few additional points, very little has been done which is directly applicable to this problem. In this paper it is proved that every finite partial linear space L is embeddable in a finite translation net generated by a partial spread of a vector space of even dimension. The question of whether every finite partial linear space is embedded in a finite André net is also explored. It is shown that for each positive integer n there exist finite partial linear spaces which do not embed in any André net of dimension less than or equal to n over its kernel. Mathematics Subject Classification (2000): 51E15, 51E26

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost simple groups with Socle $G_2(q)$ acting on finite linear spaces

 After the classification of the flag-transitive linear spaces, the attention has been turned to line-transitive linear spaces. In this article, we present a partial classification of the finite linear spaces $mathcal S$ on which an almost simple group $G$ with the socle $G_2(q)$ acts line-transitively.

متن کامل

Algorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity

We address the batch arrival  systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...

متن کامل

Modified Fixed Grid Finite Element Method in the Analysis of 2D Linear Elastic Problems

In this paper, a modification on the fixed grid finite element method is presented and used in the solution of 2D linear elastic problems. This method uses non-boundary-fitted meshes for the numerical solution of partial differential equations. Special techniques are required to apply boundary conditions on the intersection of domain boundaries and non-boundary-fitted elements. Hence, a new met...

متن کامل

Modified Fixed Grid Finite Element Method in the Analysis of 2D Linear Elastic Problems

In this paper, a modification on the fixed grid finite element method is presented and used in the solution of 2D linear elastic problems. This method uses non-boundary-fitted meshes for the numerical solution of partial differential equations. Special techniques are required to apply boundary conditions on the intersection of domain boundaries and non-boundary-fitted elements. Hence, a new met...

متن کامل

Verification of bounded Petri nets using integer programming

Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit such a semantics is to consider (finite prefixes of) net unfoldings — themselves a class of acyclic Petri nets — which contain enough information, albeit implicit, to reason about the reachable markings of the original ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008